Model Checking Properties on Reduced Trace Systems
نویسندگان
چکیده
منابع مشابه
Model Checking Properties on Reduced Trace Systems
Temporal logic has become a well-established method for specifying the behavior of distributed systems. In this paper, we interpret a temporal logic over a partial order model that is a trace system. The satisfaction of the formulae is directly defined on traces on the basis of rewriting rules; so, the graph representation of the system can be completely avoided; moreover, a method is presented...
متن کاملModel-Based Trace-Checking
Trace analysis can be a useful way to discover problems in a program under test. Rather than writing a special purpose trace analysis tool, this paper proposes that traces can usefully be analysed by checking them against a formal model using a standard model-checker or else an animator for executable specifications. These techniques are illustrated using a Travel Agent case study implemented i...
متن کاملModel Checking CTL Properties of Pushdown Systems
A pushdown system is a graph G(P ) of configurations of a pushdown automaton P . The model checking problem for a logic L is: given a pushdown automaton P and a formula α ∈ L decide if α holds in the vertex of G(P ) which is the initial configuration of P . Computation Tree Logic (CTL) and its fragment EF are considered. The model checking problems for CTL and EF are shown to be EXPTIME-complet...
متن کاملOn the complexity of partial order trace model checking
The design of a distributed system is known to be a difficult task which can be eased by various techniques including validation and debugging. The model-based design abstracts the actions the system can do into events which change its global state. Depending on the various assumptions the designer can make, the model can be either centralized, providing a global observation and control on the ...
متن کاملModel Checking Performability Properties
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a formally-specified system. In recent years, we have extended CTL such that it allows for the specification of properties over finite-state continuous-time Markov chains (CTMCs). Computational techniques for model chec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2014
ISSN: 1999-4893
DOI: 10.3390/a7030339